A Distributed Real-Time Java System Based on CSP
نویسندگان
چکیده
CSP is a fundamental concept for developing software for distributed real-time systems. The CSP paradigm constitutes a natural addition to Object Orientation and offers higher-order multithreading constructs. The CSP channel concept that has been implemented in Java deals with singleand multi-processor environments and also takes care of the real-time priority scheduling requirements. For this, the notion of priority and scheduling has been carefully examined and as a result it was reasoned that priority scheduling should be attached to the communicating channels rather than to the processes. In association with channels, a priority based parallel construct is developed for composing processes – hiding threads and priority indexing from the user. This approach simplifies the use of priorities for the objectoriented paradigm. Moreover, in the proposed system, the notion of scheduling is no longer connected to the operating system but has become part of the application instead.
منابع مشابه
Communicating Threads for Java
The Java thread model provides support for multithreading within the language and runtime system of Java. The Java synchronization and scheduling strategy is poorly specified and turns out to be of unsatisfactory real-time performance. The idea of Java is to let the underlying operating system specify the synchronization and scheduling principles. This may possibly result in different behavior ...
متن کاملIntegrated Design Tool for Embedded Control Systems *)
Currently, computer-based control systems are still being implemented using the same techniques as 10 years ago. The purpose of this project is the development of a design framework, consisting of tools and libraries, which allows the designer to build high reliable heterogeneous real-time embedded systems in a very short time at a fraction of the present day costs. The ultimate focus of curren...
متن کاملCAN Fieldbus Communication in the CSP–Based CT Library
In closed-loop control systems several realworld entities are simultaneously communicated to through a multitude of spatially distributed sensors and actuators. This intrinsic parallelism and complexity motivates implementing control software in the form of concurrent processes deployed on distributed hardware architectures. A CSP based occam-like architecture seems to be the most convenient fo...
متن کاملImplementing a Distributed Algorithm for Detection of Local Knots and Cycles in Directed Graphs
In general, most deadlocks take form of cycles (in database systems) and knots (in communication systems). Boukerche and Tropper have proposed a distributed algorithm to detect cycles and knots in generic graphs. Their algorithm has a message complexity of 2m vs. (at least) 4m for the Chandy and Misra algorithm, where m is the number of links in the graph, and requires O (n log n) bits of memor...
متن کاملReal-Time Concepts Implemented in Distributed System Programming Languages
The problem of time measuring and managing in distributed systems is important both as an independent problem and for reasons like: the maintenance of the consistency of distributed data, the elimination of duplicated data and the verification of the authenticity of a request. After presenting the main problems that appear during distributed system design and programming, the paper continues wi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000